On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates
نویسندگان
چکیده
We prove that, somewhat surprisingly, there is no blackbox reduction of (poly-to-one) trapdoor functions to trapdoor predicates (equivalently, to public-key encryption schemes). Our proof follows the methodology that was introduced by Impagliazzo and Rudich [19], although we use a new, weaker model of separation.
منابع مشابه
On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function
We show that non-interactive statistically-secret bit commitment cannot be constructed from arbitrary black-box one-to-one trapdoor functions and thus from general public-key cryptosystems. Reducing the problems of non-interactive crypto-computing, rerandomizable encryption, and non-interactive statistically-sender-private oblivious transfer and low-communication private information retrieval t...
متن کاملAn Experimental Investigation into the Arching Effect in Fine Sand
In the current paper results of a well instrumented experimental procedure for studying the arching effect in loose and dense sand are presented. The apparatus comprises concentric circular trapdoors with different diameters that can yield downward while stresses and deformations are recorded simultaneously. As the trapdoor starts to yield, the whole soil mass deforms elastically. However, afte...
متن کاملFrictional Strain Hardening-softening in Experimental and Numerical Investigation of Arching Effect
In the current paper the results of a numerical simulation that were verified by a well instrumented experimental procedure for studying the arching effect over a trapdoor in sand is presented. To simulate this phenomenon with continuum mechanics, the experimental procedure is modeled in ABAQUS code using stress dependent hardening in elastic state and plastic strain dependent frictional harden...
متن کاملBasing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art
The purpose of this article is to correct the inaccurate account of this subject that is provided in our two-volume work Foundation of Cryptography. Specifically, as pointed out by Jonathan Katz, it seems that the construction of Non-Interactive Zero-Knowledge proofs for NP requires the existence of a doubly-enhanced collection of trapdoor permutations (to be defined below). We stress that the ...
متن کاملOn the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
We know that trapdoor permutations can be used to construct all kinds of basic cryptographic primitives, including trapdoor functions, public-key encryption, private information retrieval, oblivious transfer, key agreement, and those known to be equivalent to one-way functions such as digital signature, private-key encryption, bit commitment, pseudo-random generator and pseudo-random functions....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001